Enhanced Doubling Attacks on Signed-All-Bits Set Recoding

نویسندگان

  • HeeSeok Kim
  • Tae Hyun Kim
  • Jeong Choon Ryoo
  • Dong-Guk Han
  • Howon Kim
  • Jongin Lim
چکیده

In cryptographic devices like a smart card whose computing ability and memory are limited, cryptographic algorithms should be performed efficiently. However, the issue of efficiency sometimes raises vulnerabilities against side channel attacks (SCAs). In elliptic curve cryptosystems, one of main operations is the scalar multiplication. Thus it must be constructed in safety against SCAs. Recently, Hedabou et al. proposed a signed-all-bits set (sABS) recoding as simple power analysis countermeasure, which is also secure against doubling attack (DA). In this paper we propose enhanced doubling attacks which break Hedabou’s countermeasure based on sABS recoding, and then show the statistical approach of noise reduction to experiment on the proposed attacks in actuality. We also introduce a countermeasure based on a projective coordinate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signed MSB-Set Comb Method for Elliptic Curve Point Multiplication

Comb method is an efficient method to calculate point multiplication in elliptic curve cryptography, but vulnerable to power-analysis attacks. Various algorithms have been proposed recently to make the comb method secure to power-analysis attacks. In this paper, we present an efficient comb method and its Simple Power Analysis (SPA)-resistant counterpart. We first present a novel comb recoding ...

متن کامل

Fast Modular Exponentiation

The well-known binary method computes C = M (mod N) using an average number of 1:5(n 1) multiplications, where n is the number of bits in the binary expansion of E. When the exponent is recoded using the canonical bit recoding technique then the average number of multiplications can be reduced to 1:33(n 1). We show that a further reduction is achieved if the bits of the exponent are scanned at ...

متن کامل

Investigation of Some Attacks on GAGE (v1), InGAGE (v1), (v1.03), and CiliPadi (v1) Variants

In this paper, we present some attacks on GAGE, InGAGE, and CiliPadi which are candidates of the first round of the NIST-LWC competition. GAGE and InGAGE are lightweight sponge based hash function and Authenticated Encryption with Associated Data (AEAD), respectively and support different sets of parameters. The length of hash, key, and tag are always 256, 128, and 128 bits, respec...

متن کامل

Improvement on Ha-Moon Randomized Exponentiation Algorithm

Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. However, this category of countermeasures can only be applicable to those cryptosystems with fixed parameters on the base integer when evaluating exponentiation or to some classes of cryptosystems such that the inversion ...

متن کامل

Exponent Recoding and Regular Exponentiation Algorithms

This paper describes methods of recoding exponents to allow for regular implementations of m-ary exponentiation algorithms. Recoding algorithms previously proposed in the literature do not lend themselves to being implemented in a regular manner, which is required if the implementation needs to resist side-channel attacks based on simple power analysis. The advantage of the algorithms proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007